An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows

A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows

This paper considers the VRP Problem with Soft Time-Windows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper presents a multi-stage, variable neighborhood search algorithm for the VRPSTW, which uses the sam...

An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

A large neighborhood search algorithm for the vehicle routing problem with time windows

Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (vrptw) consists of determining a set of feasible routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total mileage. Each customer must be visited exactly once by a vehicle within a prescribed time interval. A route starts from the depot...